Distance-balanced graphs
نویسندگان
چکیده
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. The new concept is connected with symmetry conditions in graphs and local operations on graphs are studied with respect to it. Distance-balanced Cartesian and lexicographic products of graphs are also characterized. Several open problems are posed along the way.
منابع مشابه
Remarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملApplication of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملn-EDGE-DISTANCE-BALANCED GRAPHS
Throughout this paper, we present a new class of graphs so-called n-edgedistance-balanced graphs inspired by the concept of edge-distance-balanced property initially introduced by Tavakoli et al. [Tavakoli M., Yousefi-Azari H., Ashrafi A.R., Note on edge distance-balanced graphs, Trans. Combin. 1 (1) (2012), 1-6]. Moreover, we propose some characteristic results to recognize 2-edge-distance-bal...
متن کاملDistance-balanced graphs: Symmetry conditions
A graph X is said to be distance–balanced if for any edge uv of X , the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. A graph X is said to be strongly distance–balanced if for any edge uv of X and any integer k, the number of vertices at distance k from u and at distance k+1 from v is equal to the number of vertices at distance k + 1 from u a...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کامل